Divide and conquer algorithms - PDFSEARCH.IO - Document Search Engine

Divide and conquer algorithms
Results: 51

#	Item
21	Divide and Conquer Design and Analysis of Algorithms I Counting Add to Reading List Source URL: d396qusza40orc.cloudfront.net - Date: 2012-02-03 01:36:57
22	Practical divide-and-conquer algorithms for polynomial arithmetic William Hart1? and Andrew Novocin2?? 1 University of Warwick, Mathematics Institute, Coventry CV4 7AL, UK – http://maths.warwick. Add to Reading List Source URL: andy.novocin.com Language: English - Date: 2011-11-27 15:17:33
23	Divide and Conquer Design and Analysis of Algorithms I Coun.ng Add to Reading List Source URL: d396qusza40orc.cloudfront.net Language: English - Date: 2012-06-11 09:40:05
24	Automatic Synthesis of Out-of-Core Algorithms Yannis Klonatos Andres Nötzli Andrej Spielmann Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2013-04-26 14:52:18 Algorithm Mathematical logic Theoretical computer science Function Fold Stack Divide and conquer algorithm Mathematics Computing Algorithms
25	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem ∗ Stefan N¨ aher Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:00:30 Theoretical computer science Sorting algorithms Operations research Parallel computing Quicksort Science Algorithm Speedup Divide and conquer algorithm Mathematics Convex hull algorithms Applied mathematics
26	Implementing Scalable Parallel Search Algorithms for Data-intensive Applications L. Lad´anyi1 , T. K. Ralphs?2 , and M. J. Saltzman3 1 Department of Mathematical Sciences, IBM T. J. Watson Research Center, Add to Reading List Source URL: coral.ie.lehigh.edu Language: English - Date: 2010-06-19 14:25:52 Applied mathematics Binary trees Linear programming Linear programming relaxation Relaxation Tree Divide and conquer algorithm Algorithm T-tree Mathematical optimization Mathematics Operations research
27	Analysis of a Block Arithmetic Coding: Discrete Divide and Conquer Recurrences Michael Drmota Wojciech Szpankowski Add to Reading List Source URL: www.dmg.tuwien.ac.at Language: English - Date: 2011-07-19 10:28:47 Number theory Sorting algorithms Master theorem Factorial Merge sort Central limit theorem Information theory Mathematics Combinatorics Integer sequences
28	A Master Theorem for Discrete Divide and Conquer Recurrences∗ Michael Drmota† Abstract Wojciech Szpankowski‡ 1 Add to Reading List Source URL: www.dmg.tuwien.ac.at Language: English - Date: 2010-10-21 08:10:15 Recurrence relations Number theory Analytic number theory Analysis of algorithms Master theorem Riemann hypothesis Dirichlet series Wiener–Ikehara theorem Generating function Mathematics Mathematical analysis Asymptotic analysis
29	PDF Document Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:01:36 Computer programming Sorting algorithms Theoretical computer science Quicksort Science Convex hull algorithms Speedup Algorithm Divide and conquer algorithm Computing Parallel computing Mathematics
30	CS 61B Reader #2 Data Structures (Into Java) (Fifth Edition) Paul N. Hilfinger University of California, Berkeley Add to Reading List Source URL: inst.eecs.berkeley.edu Language: English - Date: 2008-01-28 16:05:21 Analysis of algorithms Computational complexity theory Big O notation Time complexity Radix sort Algorithm Quicksort Divide and conquer algorithm Asymptotically optimal algorithm Theoretical computer science Mathematics Applied mathematics